In Proceedings of Concur '98, C a Categorical Axiomatics for Bisimulation
نویسندگان
چکیده
We give an axiomatic category theoretic account of bisimu-lation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T , on Cat. Operations on processes , such as nondeterministic sum, preexing and parallel composition are modelled using functors in the Kleisli category for the 2-monad T. We may deene the notion of open map for any such 2-monad; in examples of interest, that agrees exactly with the usual notion of functional bisimulation. Under a condition on T , namely that it be a dense KZ-monad, which we deene, it follows that functors in Kl(T) preserve open maps, i.e., they respect functional bisimulation. We further investigate structures on Kl(T) that exist for axiomatic reasons, primarily because T is a dense KZ-monad, and we study how those structures help to model operations on processes. We outline how this analysis gives ideas for modelling higher order processes. We conclude by making comparison with the use of presheaves and profunctors to model process calculi.
منابع مشابه
A Categorical Axiomatics for Bisimulation
We give an axiomatic category theoretic account of bisimulation in process algebras based on the idea of functional bisimulations as open maps. We work with 2-monads, T , on Cat. Operations on processes, such as nondeterministic sum, prefixing and parallel composition are modelled using functors in the Kleisli category for the 2-monad T . We may define the notion of open map for any such 2-mona...
متن کاملA Relational Model of Non-deterministic Dataflow
We recast dataflow in a modern categorical light using profunctors as a generalisation of relations. The well known causal anomalies associated with relational semantics of indeterminate dataflow are avoided, but still we preserve much of the intuitions of a relational model. The development fits with the view of categories of models for concurrency and the general treatment of bisimulation the...
متن کاملSProc Categorically
We provide a systematic reconstruction of Abramsky's category SProc of synchronous processes Abr93]: SProc is isomorphic to a span category on a category of traces. The signiicance of the work is twofold: It shows that the original presentation of SProc in mixed formulations is unnecessary | a simple categorical description exists. Furthermore, the techniques employed in the reconstruction sugg...
متن کاملIn Proceedings of Mfcs'98, C Timed Bisimulation and Open Maps
Open maps have been used for deening bisimulations for a range of models, but none of these have modelled real-time. We deene a category of timed transition systems, and use the general framework of open maps to obtain a notion of bisimulation. We show this to be equivalent to the standard notion of timed bisimulation. Thus the abstract results from the theory of open maps apply, e.g. the exist...
متن کاملBisimulations and Unfolding in P-Accessible Categorical Models
We propose a categorical framework for bisimulations and unfoldings that unifies the classical approach from Joyal and al. via open maps and unfoldings. This is based on a notion of categories accessible with respect to a subcategory of path shapes, i.e., for which one can define a nice notion of trees as glueings of paths. We show that transition systems and presheaf models are instances of ou...
متن کامل